Semantically Correct Query Answers in the Presence of Null Values
نویسندگان
چکیده
For several reasons a database may not satisfy a given set of integrity constraints (ICs), but most likely most of the information in it is still consistent with those ICs; and could be retrieved when queries are answered. Consistent answers to queries wrt a set of ICs have been characterized as answers that can be obtained from every possible minimally repaired consistent version of the original database. In this paper we consider databases that contain null values and are also repaired, if necessary, using null values. For this purpose, we propose first a precise semantics for IC satisfaction in a database with null values that is compatible with the way null values are treated in commercial database management systems. Next, a precise notion of repair is introduced that privileges the introduction of null values when repairing foreign key constraints, in such a way that these new values do not create an infinite cycle of new inconsistencies. Finally, we analyze how to specify this kind of repairs of a database that contains null values using disjunctive logic programs with stable model semantics.
منابع مشابه
Data Exchange: Algorithm for Computing Maybe Answers for Relational Algebra Queries
The concept of certain answers is usually used in the definition of the semantics of answering queries in data exchange. But as certain answers are defined as a relation without null values, the approaches for answering queries over databases do not always lead to semantically correct answer. In order to obtain all possible semantically correct answers, maybe answers have been considered along ...
متن کاملDeductive Databases with Incomplete Information
We consider query processing in deductive databases with incomplete information in the form of null values. We motivate the problem of extracting the maximal information from a (deductive) database in response to queries, and formalize this in the form of conditional answers. We give a sound and complete top-down proof procedure for generating conditional answers. We also extend the well-known ...
متن کاملConsistency and trust in peer data exchange systems
We propose and investigate a semantics for peer data exchange systems where different peers are related by data exchange constraints and trust relationships. These two elements plus the data at the peers’ sites and their local integrity constraints are made compatible via a semantics that characterizes sets of solution instances for the peers. They are the intended -possibly virtualinstances fo...
متن کاملApproximate Query Answering with Knowledge Hierarchy
Database query processing has mostly focused on addressing exact answers in terms of Boolean model. There are a number of circumstances in which a user desires an approximate answer rather than the exact answer. At first, when a user does not always understand all about the data schema or the queries contain errors syntactically or semantically, then the query results may be null or be thrown u...
متن کاملHandling Imprecision & Incompleteness in Autonomous Databases
As more and more information from autonomous web databases becomes available to lay users, query processing over these databases must adapt to deal with the imprecise nature of user queries as well as incompleteness due to missing attribute values (aka “null values”) in the database. In such scenarios, the query processor begins to acquire the role of a recommender system. Specifically, in addi...
متن کامل